Program Obfuscation and Encrypted Computation
نویسنده
چکیده
For my study project I investigate encrypted computation, or program obfuscation. This is an interesting concept for its own sake, but also because a successful scheme would allow a program running on an untrustworthy system to carry and use secret cryptographic keys securely. A symmetric-key encryption scheme becomes a public-key scheme by obfuscating Ek(·); an obfuscated mobile software agent can carry and use a signing key.
منابع مشابه
Computing on the Edge of Chaos: Structure and Randomness in Encrypted Computation
This survey, aimed mainly at mathematicians rather than practitioners, covers recent developments in homomorphic encryption (computing on encrypted data) and program obfuscation (generating encrypted but functional programs). Current schemes for encrypted computation all use essentially the same “noisy” approach: they encrypt via a noisy encoding of the message, they decrypt using an “approxima...
متن کاملTuring Functional Ciphertext
Current research literature for protecting mobile agents from malicious execution environments, such as homomorphic encryption schemes, Boolean circuits, obfuscation and computing with encrypted functions, provide building blocks for the possibility of secure remote encrypted computations. However, existing solutions are only partial and additional research is needed to reach the ideal conditio...
متن کاملOn the Security of Practical and Complete Homomorphic Encrypted Computation
Security with respect to the operator as an adversary is considered for processors supporting unbounded general purpose homomorphic encrypted computation. An efficient machine code architecture is defined for those platforms and it is proved that user programs expressed in it are cryptographically obfuscated, guaranteeing privacy though they, their traces and (encrypted) data are visible to the...
متن کاملSecure Obfuscation for Encrypted Signatures
Obfuscation is one of the most intriguing open problems in cryptography and only a few positive results are known. In TCC’07, Hohenberger et al. proposed an obfuscator for a re-encryption functionality, which takes a ciphertext for a message encrypted under Alice’s public key and transforms it into a ciphertext for the same message under Bob’s public key [24]. It is the first complicated crypto...
متن کاملSemantically Secure Order-Revealing Encryption: Multi-input Functional Encryption Without Obfuscation
Deciding “greater-than” relations among data items just given their encryptions is at the heart of search algorithms on encrypted data, most notably, non-interactive binary search on encrypted data. Order-preserving encryption provides one solution, but provably provides only limited security guarantees. Two-input functional encryption is another approach, but requires the full power of obfusca...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004